Cosines and Cayley, Triangles and Tetrahedra

نویسنده

  • Marshall Hampton
چکیده

This article surveys some of the more aesthetically appealing and useful formulas relating distances, areas, and angles in triangles and tetrahedra. For example, a somewhat neglected trigonometric identity involving only the cosines of a triangle is an instance of the famous Cayley cubic surface. While most of these formulas are well known, some novel identities also make an appearance. Heron’s formula and the Cayley–Menger determinant. Many people learn in school that for a triangle with vertices A, B, and C , the area of the triangle, ABC, can be computed from Heron’s formula [2, 13], ABC = √ s(s − rAB)(s − rAC)(s − rBC) (1) in which ri j is the distance between vertex i and vertex j , and s is the semiperimeter s = rAB + rAC + rBC 2 . Almost two thousand years later, a form of Heron’s formula was found that generalizes to simplices of any dimension. This is the Cayley–Menger determinant; for a triangle: −16 ABC = det ⎛ ⎜⎜⎜⎝ 0 1 1 1 1 0 r 2 AB r 2 AC 1 r 2 AB 0 r 2 BC 1 r 2 AC r 2 BC 0 ⎞ ⎟⎟⎟⎠ = −(−rAB + rAC + rBC)(rAB − rAC + rBC)(rAB + rAC − rBC) × (rAB + rAC + rBC). The matrix in the determinant is called the Cayley–Menger matrix. Cayley found the determinantal form [7]—the polynomial itself was known earlier, by Lagrange. Menger discovered a number of further properties of the matrix and closely related variants of it [14]. For an n − 1-dimensional simplex of n vertices A1, . . . An , the volume formula generalizes to 2A1...An = (−1)n+1 2n(n!)2 det ⎛ ⎜⎜⎜⎜⎝ 0 1 1 . . . 1 1 0 r 2 A1 A2 . . . r 2 A1 An 1 r 2 A1 A2 0 . . . r 2 A2 An . . . . . . . . . . . . . . . 1 r 2 A1 An r 2 A2 An . . . 0 ⎞ ⎟⎟⎟⎟⎠ . (2) The definitive article about the Cayley–Menger matrix is [5], and its properties are also nicely summarized in [4]. The use of distances as coordinates is masterfully http://dx.doi.org/10.4169/amer.math.monthly.121.10.937 MSC: Primary 51K05, Secondary 52-02 December 2014] NOTES 937 investigated in [1] and, with particular attention paid to triangles, in [8]. Some uses and variants of the Cayley–Menger determinant are discussed in [11, 12]. Laws of cosines. For brevity in some of the more complex formulae, we write cABC for the cosine of the angle ABC. The classic law of cosines is r 2 AB − r 2 AC − r 2 BC + 2rACrBCcACB = 0. One derivation of the law of cosines makes use of the relations of the form rAB = rACcBAC + rBCcABC (3) which can be used for many purposes because of their linearity in the distances and cosines. These relations generalize to the n-dimensional simplex through the polyhedral version of the divergence theorem. If we choose a vector field to be the outward-pointing normal ni to the i th facet of a bounded convex polyhedron, then the divergence of the field is 0. This is equal to the surface integral

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rainbow tetrahedra in Cayley graphs

Let Γn be the complete undirected Cayley graph of the odd cyclic group Zn. Connected graphs whose vertices are rainbow tetrahedra in Γn are studied, with any two such vertices adjacent if and only if they share (as tetrahedra) precisely two distinct triangles. This yields graphs G of largest degree 6, asymptotic diameter |V (G)| and almost all vertices with degree: (a) 6 in G; (b) 4 in exactly ...

متن کامل

TMC tetrahedral types MOD 2k + 1 and their structure graphs

In [3,4,5], we treated edge weighted tetrahedra with a zero-sum condition on their triangles as the vertices of a graph Gi,n whose adjacency is given by the sharing of pairs ofedge-weighted triangles. In the present paper, we consider the situation modulo an odd positive integer n, so that we deal with hnite graph G'^,o. However, we are interested in a subgraph Gi.n of G;.4 that sheds light on ...

متن کامل

Recognizing the Hidden Structure of Cayley Graphs

Extending the srudy of triangles and tetrahedra in Cayley graphs of cyclic groups, we define a ki-type as an edge-weighted complete graph on i vertices with nonnegative integer weights respecting a triangular sum condition. The interaction among K4-types is reflected in the structure graph G(2, 4) of K4-types, whose vertices are K4-types and where two vertices are adjacent if they share two K3-...

متن کامل

A Set of Symmetric Quadrature Rules on Triangles and Tetrahedra

We present a program for computing symmetric quadrature rules on triangles and tetrahedra. A set of rules are obtained by using this program. Quadrature rules up to order 21 on triangles and up to order 14 on tetrahedra have been obtained which are useful for use in finite element computations. All rules presented here have positive weights with points lying within the integration domain. Mathe...

متن کامل

Graphs of Permutation Groups

1. Dejter, I., Giudici, R.E.: On Unitary Cayley graphs, JCMCC, 18,121-124. 2. Brrizbitia, P and Giudici, R.E. 1996, Counting pure k-cycles in sequence of Cayley graphs, Discrete math., 149, 11-18. 3. Madhavi, L and Maheswari, B.2009, Enumeration of Triangles and Hamilton Cycles in Quadratic residue Cayley graphas, Chamchuri Journal of Mathematics, 1,95-103. 4. Madhavi, L and Maheswari, B. 2010,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • The American Mathematical Monthly

دوره 121  شماره 

صفحات  -

تاریخ انتشار 2014